Spectra of infinite graphs: two methods of computation
نویسندگان
چکیده
Two method for computation of the spectra certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on spectral theory Jacobi matrices. second is related to Schur complement block A number examples including with tails, chains cycles and ladders worked out in detail.
منابع مشابه
A Survey on Spectra of Infinite Graphs
In the last decade, considerable attention has been paid by graph theorists to the study of spectra of graphs and their interaction with structure and characteristic properties of graphs. After the 'classical' book by N. L. Biggs [12] on algebraic graph theory in general, the first comprehensive monograph on this particular topic, by D. M. Cvetkovic, M. Doob and H. Sachs [34], appeared in 1979....
متن کاملINTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
متن کاملComputation of Earthquake Response via Fourier Amplitude Spectra
A theoretical relation is presented between the seismological Fourier amplitude spectrumand the mean squared value of the elastic response, which is defined by Gaussian distribution. Byshifting a general process to its mean value, spectrum of the mean squared value of the displacementis computed from the Fourier amplitude spectrum and the real part of the relative displacementtransfer function ...
متن کاملInfinite probability computation by cyclic explanation graphs
Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to compute an infinite sum of probabilities for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operators and Matrices
سال: 2021
ISSN: ['1848-9974', '1846-3886']
DOI: https://doi.org/10.7153/oam-2021-15-63